A transformational-based learner for dependency grammars in discharge summaries
نویسندگان
چکیده
NLP systems will be more portable among medical domains if acquisition of semantic lexicons can be facilitated. We are pursuing lexical acquisition through the syntactic relationships of words in medical corpora. Therefore we require a syntactic parser which is flexible, portable, captures head-modifier pairs and does not require a large training set. We have designed a dependency grammar parser that learns through a transformational-based algorithm. We propose a novel design for templates and transformations which capitalize on the dependency structure directly and produces human-readable rules. Our parser achieved a 77% accurate parse training on only 830 sentences. Further work will evaluate the usefulness of this parse for lexical acquisition.
منابع مشابه
From Strings to Trees to Strings to Trees ... (Abstract)
A certain amount of structure is necessary simply because a clause may embed another clause, or one clause may attach to another clause or parts of it. Leaving this need of structure aside, the question then is how much structure should a (minimal) clause have? Grammar formalisms can differ significantly on this issue. Minimal clauses can be just strings, or words linked by dependencies (depend...
متن کاملBetter Learning and Decoding for Syntax Based SMT Using PSDIG
As an approach to syntax based statistical machine translation (SMT), Probabilistic Synchronous Dependency Insertion Grammars (PSDIG), introduced in (Ding and Palmer, 2005), are a version of synchronous grammars defined on dependency trees. In this paper we discuss better learning and decoding algorithms for a PSDIG MT system. We introduce two new grammar learners: (1) an exhaustive learner com...
متن کاملOn Restrictions on Transformational Grammars Reducing the Generative Power
Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a genera...
متن کاملNatural Language Processing Using Generative Indirect Dependency Grammar
Abstract. This paper presents an extension of the Generative Dependency Grammar (GDG) and GDG with Feature Structure (FS). The extension consist of the indirect dependency notion introduction. The direct dependencies allows to expres some relations between elements (for exemples non-terminals) belonging to the the right side of a single grammar rule. The indirect relations will allow to express...
متن کاملOn the Generative Power of
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists in their investigation of these grammars, such as Chomsky’s characterization in terms of self-embedding of those context-free languages which are not regular. The recent shift of focus in linguistic theory to transformational grammars has not been accompanied by a similar application of mathemati...
متن کامل